Routing airlift aircraft by the double-sweep algorithm
نویسندگان
چکیده
منابع مشابه
Sweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملRouting Military Aircraft with a Constrained Shortest-path Algorithm
We formulate and solve aircraft-routing problems that arise when planning missions for military aircraft that are subject to ground-based threats such as surface-to-air missiles. We use a constrained-shortest path (CSP) model that discretizes the relevant airspace into a grid of vertices representing potential waypoints, and connects vertices with directed edges to represent potential flight se...
متن کاملA sweep-based algorithm for the fleet size and mix vehicle routing problem
This paper presents a new sweep based heuristic for the fleet size and mix vehicle routing problem. This problem involves two kinds of decisions: the selection of a mix of vehicles among the available vehicle types and the routing of the selected fleet. The proposed algorithm first generates a large number of routes that are serviced by one or two vehicles. The selection of routes and vehicles ...
متن کاملRobust Aircraft Routing
We propose a robust optimization approach to minimize total propagated delay in the aircraft routing problem, a setting first developed by Lan et al. (2006) and then extended by Dunbar et al. (2012, 2014). Instead of minimizing the expected total propagated delay by assuming that flight leg delays follow specific probability distributions, our model minimizes the maximal possible total propagat...
متن کاملOptimized Schwarz Algorithm with Double Sweep Preconditioner for the Helmholtz Equation
In previous work (Y. Boubendir, X. Antoine and C. Geuzaine, A quasi-optimal nonoverlapping domain decomposition algorithm for the Helmholtz equation, JCP, 231, pp. 262-280, 2012), it was shown how a Domain Decomposition Method (DDM) formulation of the Helmholtz problem, using impedance-matching boundary conditions, can be set up and accelerated with a Krylov solver. This optimized Schwarz algor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical and Computer Modelling
سال: 1999
ISSN: 0895-7177
DOI: 10.1016/s0895-7177(99)00153-3